An O(n2) time algorithm for the minimal permutation completion problem
نویسندگان
چکیده
منابع مشابه
An O(n^2) Time Algorithm for the Minimal Permutation Completion Problem
We provide an O(n2) time algorithm computing a minimal permutation completion of an arbitrary graph G = (V,E), i.e., a permutation graph H = (V, F ) on the same vertex set, such that E ⊆ F and F is inclusion-minimal among all possibilities.
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn O(n2) algorithm for the minimal interval completion problem
The minimal interval completion problem consists in adding edges to an arbitrary graph so that the resulting graph is an interval graph; the objective is to add an inclusion minimal set of edges, which means that no proper subset of the added edges can result in an interval graph when added to the original graph. We give an O(n) time algorithm to obtain a minimal interval completion of an
متن کاملAn O(n)-time algorithm for the minimal interval completion problem
The minimal interval completion problem consists in adding edges to an arbitrary graph so that the resulting graph is an interval graph; the objective is to add an inclusion minimal set of edges, which means that no proper subset of the added edges can result in an interval graph when added to the original graph. We give an O(n2)-time algorithm to obtain a minimal interval completion of an arbi...
متن کاملMILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.06.036